@Article{CorręaLoreRibe:2009:NoLiLa,
               author = "Corr{\^e}a, Francisco de Assis and Lorena, Luiz Antonio Nogueira 
                         and Ribeiro, Glaydston Mattos",
          affiliation = "Paulista University (UNIP), S{\~a}o Jos{\'e} dos Campos – SP, 
                         Brazil and {Instituto Nacional de Pesquisas Espaciais (INPE)} and 
                         Federal University of Esp{\'{\i}}rito Santo (UFES), S{\~a}o 
                         Mateus – ES, Brazil",
                title = "Novos limitantes lagrangeanos para o problema 
                         probabil{\'{\i}}stico de 
                         localiza{\c{c}}{\~a}o-aloca{\c{c}}{\~a}o de m{\'a}xima 
                         cobertura utilizando grafos de cobertura /New lagrangean bounds 
                         for the probabilistic Maximal Covering Location-Allocation Problem 
                         using covering graphs",
              journal = "Gest{\~a}o \& Produ{\c{c}}{\~a}o",
                 year = "2009",
               volume = "16",
               number = "2",
                pages = "260--272",
                month = "abr.-jun.",
             keywords = "relaxa{\c{c}}{\~a}o lagrangeana, relaxa{\c{c}}{\~a}o 
                         lagrangeana com clusters, problemas de localiza{\c{c}}{\~a}o, 
                         m{\'a}xima cobertura, lagrangean relaxation, lagrangean 
                         relaxation with clusters, location problems, maximal covering.",
             abstract = "O Problema Probabil{\'{\i}}stico de 
                         Localiza{\c{c}}{\~a}o-Aloca{\c{c}}{\~a}o de M{\'a}xima 
                         Cobertura (PPLAMC) consiste em localizar facilidades, maximizando 
                         a popula{\c{c}}{\~a}o atendida e fornecendo um bom 
                         n{\'{\i}}vel de servi{\c{c}}o para toda a 
                         popula{\c{c}}{\~a}o, ou seja, deve-se garantir que um 
                         usu{\'a}rio, ao chegar a um centro, n{\~a}o espere mais que um 
                         tempo m{\'a}ximo permitido ou n{\~a}o encontre uma fila de 
                         atendimento com um n{\'u}mero de usu{\'a}rio maior que um valor 
                         m{\'a}ximo. Estes dois par{\^a}metros dependem da taxa de 
                         chegada dos usu{\'a}rios e do atendimento, ambos 
                         probabil{\'{\i}}sticos. Devido {\`a}s dificuldades 
                         intr{\'{\i}}nsecas do problema, neste artigo s{\~a}o discutidos 
                         limitantes lagrangeanos para o PPLAMC obtidos com a 
                         relaxa{\c{c}}{\~a}o lagrangeana com clusters (LagClus). Na sua 
                         proposi{\c{c}}{\~a}o inicial, a LagClus utilizou um grafo de 
                         conflitos, por{\'e}m neste artigo esta relaxa{\c{c}}{\~a}o foi 
                         aplicada em um grafo especial denominado grafo de cobertura. 
                         ABSTRACT: The Probabilistic Maximal Covering Location-Allocation 
                         Problem (PMCLAP) aims to locate facilities maximizing the number 
                         of people served and providing a good level of service. This means 
                         that customers would not have to wait longer than the wait time 
                         established or to wait in long lines. These parameters are 
                         influenced by the number of the requests for service and service 
                         time, both probabilistic. The PMCLAP is NP-Complete and in this 
                         paper we study bounds with a Lagrangean Relaxation with Clusters 
                         (LagClus). Instead of using a conflict graph to represent a 
                         problem, in this paper another strategy for the use of LagClus 
                         using a special graph called covering graph is proposed. This 
                         approach provides interesting bounds.",
           copyholder = "SID/SCD",
                  doi = "10.1590/S0104-530X2009000200009",
                  url = "http://dx.doi.org/10.1590/S0104-530X2009000200009",
                 issn = "0104-530X",
                label = "lattes: 7195702087655314 2 Corr{\^e}aLoreRibe:2009:NoLiLa",
             language = "pt",
           targetfile = "v16n2a09.pdf",
        urlaccessdate = "08 maio 2024"
}